import heapq
from heapq_heapdata import data
from heapq_showtree import show_tree

heapq.heapify(data)

for i in range(2):
    smallest = heapq.heappop(data)
    print('pop: {:>3}'.format(smallest))
    show_tree(data)
